| 翻訳と辞書 |
| David Conlon ： ウィキペディア英語版 |
David Conlon
David Conlon (born 1982) is an Irish mathematician. He earned a Ph.D. from Cambridge University in 2009; he is a fellow of Wadham College, Oxford and a lecturer in the department of mathematics at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.
Conlon has worked in Ramsey theory. In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.
He won the European Prize in Combinatorics in 2011, for his work in Ramsey theory and for his progress on Sidorenko's conjecture that, for any bipartite graph ''H'', random bipartite graphs have the fewest subgraphs isomorphic to ''H''.〔.〕
==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「David Conlon」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|